Eecient Synthesis of Anddxor Networks

نویسندگان

  • Yibin Ye
  • Kaushik Roy
چکیده

|A new graph-based synthesis method for general Exclusive Sum-of-Product forms (ESOP) is presented in this paper. Previous research has largely concentrated on a class of ESOP's, the Canonical Restricted Fixed/Mixed Polarity Reed-Muller form, also known as Generalized Reed-Muller (GRM) form. However, for many functions, the minimum GRM can be much worse than the ESOP. We have de ned a Shared Multiple Rooted XOR-based Decomposition Diagram (XORDD) to represent functions with multiple outputs. By iteratively applying transformations and reductions, we obtain a compact XORDD which gives a minimized ESOP. Our method can synthesize larger circuits than previously possible. The compact ESOP representation provides a form that is easier to synthesize for XOR heavy multilevel circuit, such as arithmetic functions. The method successfullyminimized large functionswith multiple outputs. Results are also compared to the minimized SOP's obtained from ESPRESSO. Experimental results show that for many circuits ESOP's have considerably more compact form than SOP's.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eecient Veriication and Synthesis Using Design Commonalities

In this paper we solve the problem of identifying a \matching" between two logic circuits or \net-works". A matching is a functions that maps each gate or \node" in the new circuit into one in the old circuit (if a matching does not exist it maps it to null). We present both an exact and a heuristic way to solve the maximal matching problem. The matching problem does not require any input corre...

متن کامل

Using ATM Virtual Private Networks for the Internet Data Tra cCarlos

Several schemes for the transport of Internet data traac over ATM are currently being investigated by researchers as well as by standardization bodies. Typically, the main focus of these investigations has been on addressing and switching strategies. Relatively little attention has been given to the eecient allocation, utilization and management of the underlying ATM bandwidth, and to the eecie...

متن کامل

Dynamic and Compiled Communication in Optical Time{division{multiplexed Point{to{point Networks Dynamic and Compiled Communication in Optical Time{division{multiplexed Point{to{point Networks

Optical interconnection networks are promising networks for future supercomput-ers due to their large bandwidths. However, the speed mismatch between the fast optical data transmission and the relatively slow electronic control components poses challenges for designing an optical network whose large bandwidth can be utilized by end users. The Time{Division{Multiplexing (TDM) technique alleviate...

متن کامل

A Fast Multicast Routing Algorithm for Delay-Sensitive Applications

EEcient algorithm for model further extended to allow \dynamic membership" (to appear at INFOCOM'98). EEcient algorithm for low-degree multicast tree problem. 19 Conclusions Proposed algorithm produces near-optimal multicast trees for small and sparse networks. Quality of solution is maintained even when size and density of networks grow. Computation time is polynomially bounded and expected to...

متن کامل

5 Concluding Remarks

Table 3: V : power-eecient mapping with min-power t decomp , VI : power-eecient mapping with bh minpower t decomp circuit I II gate delay aver. gate delay aver. Table 1: I : area-delay mapping with conventional decomposition , II : area-delay mapping with minpower t decomp The active cell area is increased by an average of 12.4% while the performance is improved by an average of 1.1%. We have p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996